Constraint-based Scheduling: an Introduction for Newcomers
نویسنده
چکیده
Constraint-based scheduling is an approach for solving real-life scheduling problems by stating constraints over the problem variables. By providing generic constraint satisfaction techniques on one side and specialised constraints on the other side, constraint programming achieves a very good generality and efficiency and thus it becomes very popular in solving real-life combinatorial (optimisation) problems. In this paper we present some constraint satisfaction techniques used in constraint-based scheduling. Our goal is to introduce the technology to newcomers rather than to provide a deep survey of the area or to describe some new results there. Copyright © 2003 IFAC.
منابع مشابه
Train Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...
متن کاملA Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint
In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...
متن کاملAN EFFECTIVE METHOD FOR SIMULTANEOUSLY CONSIDERING TIME-COST TRADE-OFF AND CONSTRAINT RESOURCE SCHEDULING USING NONLINEAR INTEGER FRAMEWORK
Critical Path Method (CPM) is one of the most popular techniques used by construction practitioners for construction project scheduling since the 1950s. Despite its popularity, CPM has a major shortcoming, as it is schedule based on two impractical acceptance that the project deadline is not bounded and that resources are unlimited. The analytical competency and computing capability of CPM thus...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملThe resource-constraint project scheduling problem of the project subcontractors in a cooperative environment: Highway construction case study
Large-scale projects often have several activities which are performed by subcontractors with limited multi-resources. Project scheduling with limited resources is one of the most famous problems in the research operations and optimization cases. The resource-constraint project scheduling problem (RCPSP) is a NP-hard problem in which the activities of a project must be scheduled to reduce the p...
متن کامل